Locality estimation of parallel algorithm for distributed memory computers
نویسندگان
چکیده
منابع مشابه
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be reco...
متن کاملA Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
The Union-Find algorithm is used for maintaining a number of non-overlapping sets from a finite universe of elements. The algorithm has applications in a number of areas including the computation of spanning trees, in image processing, as well as in scientific computations. Although the algorithm is inherently sequential there has been some previous efforts at constructing parallel implementati...
متن کاملAn Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunay triangulationhas beenmuch used in such applicationsas volume rendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulation is large computation time required to obtain the triangulation on an input points set. This time can be reduced by using more than one processor, and several parallel algorithms for Delaunay triangulation have been pro...
متن کاملOn Parallel Retrievals Using Distributed Memory Computers
This paper introduces an eecient indexing organization which provides for parallel retrievals. Given a p-processor massively parallel computer, our organization allows a maximum of p retrievals to be performed concurrently and thus achieves an approximate speed up of p in the best case. The index structure is based on the multi-B-tree index structure. It is compatible with current automatic ret...
متن کاملScalability of Finite Element Applications on Distributed-memory Parallel Computers Scalability of Finite Element Applications on Distributed-memory Parallel Computers
This paper demonstrates that scalability and competitive eeciency can be achieved for unstructured grid nite element applications on distributed memory machines, such as the Connection Machine CM-5 system. The eeciency of nite element solvers is analyzed through two applications: an implicit computational aerodynamics application and an explicit solid mechanics application. Scalability of mesh ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doklady of the National Academy of Sciences of Belarus
سال: 2020
ISSN: 2524-2431,1561-8323
DOI: 10.29235/1561-8323-2020-64-6-647-656